Nested Rules in Defeasible Logic
نویسندگان
چکیده
Defeasible Logic is a rule-based non-monotonic logic with tractable reasoning services. In this paper we extend Defeasible Logic with nested rules. We consider a new Defeasible Logic, called DLns, where we allow one level of nested rules. A nested rule is a rule where the antecedent or the consequent of the rule are rules themselves. The inference conditions for DLns are based on reflection on the inference structures (rules) of the particular theory at hand. Accordingly DLns can be considered an amalgamated reflective system with implicit reflection mechanism. Finally we outline some possible applications of the logic.
منابع مشابه
Contextual Agent Deliberation in Defeasible Logic
This article extends Defeasible Logic to deal with the contextual deliberation process of cognitive agents. First, we introduce meta-rules to reason with rules. Meta-rules are rules that have as a consequent rules for motivational components, such as obligations, intentions and desires. In other words, they include nested rules. Second, we introduce explicit preferences among rules. They deal w...
متن کاملNormal Forms for Defeasible Logic
Defeasible logic is an important logic-programming based nonmonotonic reasoning formalism which has an eecient implementation. It makes use of facts, strict rules, defeasible rules, defeaters, and a superiority relation. Representation results are important because they can help the assimilation of a concept by connning attention to its critical aspects. In this paper we derive some representat...
متن کاملPropositional Defeasible Logic has Linear Complexity
Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts markedly with most other propositional nonmonotonic logics, in which inference is intractable.
متن کاملFormalizing Defeasible Logic in CAKE
Due to its efficiency, defeasible logic is one of the most interesting non-monotonic formalisms. Unfortunately, the logic has one major limitation: it does not properly deal with cyclic defeasible rules. In this paper, we provide a new variant of defeasible logic, using CAKE method. The resulting formalism is tractable and properly deals with circular defeasible rules.
متن کاملDR-DEVICE: A Defeasible Logic RDF Rule Language
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally; and for the modeling of business rules and policies, where rules with exceptions are often used. In this demonstration we present a prototype system for defeasible rea...
متن کامل